On total paracompactness and total metacompactness
نویسندگان
چکیده
منابع مشابه
Total perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملZagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
متن کاملAntioxidant activities, total phenols and total Flavonoids assay of Origanurm vulgare, Teucrium polium and Thymus daensis
Introduction: Medicinal plants are important sources of antioxidants. Natural antioxidants increase the antioxidant capacity of the plasma and reduce the risk of certain diseases such as cancer, heart diseases and stroke. Synthetic antioxidants commonly used in processed foods have side effects and are toxic. Therefore, there is a need for more effective, less toxic and cost effective ant...
متن کاملOn the paracompactness of frames
Through the study of frame congruences, new characterizations of the paracompactness of frames are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1979
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-105-1-73-78